Immunizing Public Key Cryptosystems Against Chosen Ciphertext Attacks
نویسندگان
چکیده
This paper presents three methods for strengthening public key cryptosys tems in such a way that they become secure against adaptively chosen ciphertext attacks In an adaptively chosen ciphertext attack an attacker can query the deciphering algorithm with any ciphertexts except for the exact object cipher text to be cryptanalyzed The rst strengthening method is based on the use of one way hash functions the second on the use of universal hash functions and the third on the use of digital signature schemes Each method is illus trated by an example of a public key cryptosystem based on the intractability of computing discrete logarithms in nite elds Security of the three example cryptosystems is formally proved Two other issues namely applications of the methods to public key cryptosystems based on other intractable problems and enhancement of information authentication capability to the cryptosystems are
منابع مشابه
Immunizing Public Key Cryptosystems against Chosen Ciphertext Attacks 1
This paper presents three methods for strengthening public key cryptosys-tems in such a way that they become secure against adaptively chosen ciphertext attacks. In an adaptively chosen ciphertext attack, an attacker can query the deciphering algorithm with any ciphertexts, except for the exact object cipher-text to be cryptanalyzed. The rst strengthening method is based on the use of one-way h...
متن کاملAnother Method for Attaining Security
Practical approaches to constructing public key cryptosystems secure against chosen ciphertext attacks were rst initiated by Damgard and further extended by Zheng and Seberry. In this paper we rst point out that in some cryptosystems proposed by Zheng and Seberry the method for adding authentication capability may fail just under known plaintext attacks. Next, we present a new method for immuni...
متن کاملImproved Public Key Cryptosystems Secure against Chosen Ciphertext Attacks
This note describes an improvement to the rst two of the three public key cryptosystems proposed by Zheng and Seberry, which are provably secure against chosen ciphertext attacks. The improvement removes a shortcoming with the original cryptosystems, which occurs when they are used for both con dentiality and sender authentication purposes.
متن کاملPublic-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks
We show how to construct a public-key cryptosystem (as originally deened by Diie and Hellman) secure against chosen ciphertext attacks, given a public-key cryptosystem secure against passive eavesdropping and a non-interactive zero-knowledge proof system in the shared string model. No such secure cryptosystems were known before.
متن کاملNoncommutative Polly Cracker-type cryptosystems and chosen-ciphertext security
In this paper we consider chosen-ciphertext attacks against noncommutative Polly Cracker-type cryptosystems. We present several versions of these attacks, as well as techniques to counter them. First we introduce a chosen-ciphertext attack, which assumes a very simple private key. We then present generalizations of this attack which are valid in more general situations, and propose a simple but...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Journal on Selected Areas in Communications
دوره 11 شماره
صفحات -
تاریخ انتشار 1993